Resource Allocation on Dynamic Con ict Graphs

The sharing of resources among processes in a distributed system leads to a connict graph that may change with time. Resource allocation over a static connict graph (also called the dining philosophers problem) has been studied extensively. We seek to solve resource allocation on dynamic connict graphs by using existing algorithms that work only for static connict graphs. In the process we deene the notion of a snapshot of a dynamic graph, specify its properties, and show how it can be combined with static graph algorithms to yield eecient solutions for dynamic graphs.